Paraconsistent semantics for Pavelka style fuzzy sentential logic

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paraconsistent semantics for Pavelka style fuzzy sentential logic

1 The root of this work is on the one hand in Belnap’s four valued paraconsistent logic, and on the other hand on Pavelka’s papers further developed by Turunen. We do not introduce a new non–classical logic but, based on a related study of Perny and Tsoukiás, we introduce paraconsistent semantics of Pavelka style fuzzy sentential logic. Restricted to Lukasiewicz t–norm, our approach and the app...

متن کامل

Pavelka-style Fuzzy Logic for Attribute Implications

We present Pavelka-style fuzzy logic for reasoning about attribute implications, i.e. formulas A ⇒ B known also as association rules and functional dependencies. Fuzzy attribute implications allow for two different interpretations, namely, in data tables with graded (fuzzy) attributes and in data tables over domains with similarity relations. In the first interpretation, A ⇒ B reads “each objec...

متن کامل

Pavelka-style fuzzy logic in retrospect and prospect

We trace the origin and development of Pavelka-style fuzzy logic, discuss its significance and clarify some related misconceptions. © 2015 Elsevier B.V. All rights reserved.

متن کامل

Paraconsistent Semantics for Extended Logic Programs

We introduce a declarative semantics for extended logic programs, and demonstrate its usefulness for reasoning with uncertainty. We show that this is a robust formalism that overcomes some drawbacks of related xpoint semantics for incomplete or inconsistent logic programs.

متن کامل

A Paraconsistent Semantics for Generalized Logic Programs

We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fuzzy Sets and Systems

سال: 2010

ISSN: 0165-0114

DOI: 10.1016/j.fss.2009.12.017